Rank of a matrix

In this leson we describe how the orthogonalization algorithm can be used to obtain the rank of a matrix. The method is very simple, because we determine if a row or column vector of the matrix belongs to the subspace of the previous uones and even we obtain the coefficients for the linear combination. The method is much simpler than the one based on obtaining the minors, a large collection of determinants that must be non null to get the rank.